Practical backward unlinkable revocation in FIDO, German e-ID, Idemix and U-Prove
نویسنده
چکیده
FIDO, German e-ID, Idemix and U-Prove constitute privacyenhanced public-key infrastructures allowing users to authenticate in an anonymous way. This however hampers timely revocation in a privacy friendly way. From a legal perspective, revocation typically should be effective within 24 hours after user reporting. It should also be backward unlinkable, i.e. user anonymity cannot be removed after revocation. We describe a new, generic revocation mechanism based on pairing based encryption and apply it to supplement the systems mentioned. This allows for both flexible and privacy friendly revocation. Protocol execution takes less than a quarter of a second on modern smartcards. An additional property is that usage after revocation is linkable, allowing users to identify fraudulent usage after revocation. Our technique is the first Verifier Local Revocation scheme with backwards unlinkable revocation for the systems mentioned. This also allows for a setup resembling the well-known Online Certificate Status Protocol (OCSP). Here the service provider sends a pseudonym to a revocation provider that returns its status. As the information required for this is not secret the status service can be distributed over many cloud services. In addition to the status service our technique also supports the publication of a central revocation list.
منابع مشابه
A Backward Unlinkable Secret Handshake Scheme with Revocation Support in the Standard Model
Secret handshake schemes have been proposed to achieve private mutual authentications, which allow the members of a certain organization to anonymously authenticate each other without exposing their affiliations. In this paper, a backward unlinkable secret handshake scheme with revocation support (BU-RSH) is constructed. For a full-fledged secret handshake scheme, it is indispensable to furnish...
متن کاملEvaluation of Privacy-ABC Technologies - a Study on the Computational Efficiency
Privacy-enhancing attribute-based credential (Privacy-ABC) technologies use different cryptographic methods to enhance the privacy of the users. This results in important practical differences between Privacy-ABC technologies, especially with regard to efficiency, which have not been studied in depth, but is necessary for assessing their suitability for deployment on devices with limited comput...
متن کاملAn Overlooked Cryptographic Requirement for NSTIC
NSTIC [1] calls for the deployment of privacy-friendly (PF) credentials (based on privacy-enhancing technologies) on the Web. Since this has never been suc cessfully accomplished before, it should be considered an emerging application of cryptography. Most PF credentials are designed for issuance-show and multi-show unlinkabil ity (with the notable exception of U-Prove, which does not provide...
متن کاملPrivacy and accountability in identity systems: the best of both worlds
Privacy and accountability are widely believed to be opposing goals in identity systems. On one hand, service providers require users to be identifiable to reduce fraud; on the other, users want to limit tracking while minimizing the amount of information disclosed about them. As a result, debates on identity become a rope pulling effort with privacy proponents on one end and security ones on t...
متن کاملCross-Unlinkable Hierarchical Group Signatures
We introduce the notion of Cross-Unlinkability for group signature schemes. Considering groups organized in a tree structure, where belonging to the parent group is required to join a new group, CrossUnlinkability enables a cascade revocation process that takes into account the underlying tree structure, while ensuring anonymity for nonrevoked users, in particular, towards the managers of the o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- IACR Cryptology ePrint Archive
دوره 2016 شماره
صفحات -
تاریخ انتشار 2016